An Explicit Edge-Coloring of $K_n$ with Six Colors on Every $K_5$
نویسندگان
چکیده
منابع مشابه
Improved Edge-Coloring with Three Colors
We show an O(1.344) = O(2) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, O(2) algorithm of Beigel and Eppstein [1]. We apply a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and con-
متن کاملDeterministic Distributed Edge-Coloring with Fewer Colors
We present a deterministic distributed algorithm, in the LOCALmodel, that computes a (1+o(1))∆edge-coloring in polylogarithmic-time, so long as the maximum degree ∆ = Ω̃(logn). For smaller ∆, we give a polylogarithmic-time 3∆/2-edge-coloring. These are the first deterministic algorithms to go below the natural barrier of 2∆− 1 colors, and they improve significantly on the recent polylogarithmict...
متن کاملEdge-Coloring Cliques with Three Colors on All 4-Cliques
A coloring of the edges of Kn is constructed such that every copy of K4 has at least three colors on its edges. As n → ∞, the number of colors used is eO( √ log n ). This improves upon the previous probabilistic bound of O( √ n ) due to Erdős and Gyárfás.
متن کاملDecidability of plane edge coloring with three colors
Abstract. This investigation studies the decidability problem of plane edge coloring with three symbols. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of p colors are arranged side by side such that the touching edges of the adjacent tiles have the same colors. Given a basic set B of Wang tiles, the decision problem is to find an algorithm to det...
متن کاملAcyclic edge coloring of planar graphs with Δ colors
An acyclic edge coloring of a graph is a proper edge coloring without bichromatic cycles. In 1978, it was conjectured that ∆(G) + 2 colors suffice for an acyclic edge coloring of every graph G [6]. The conjecture has been verified for several classes of graphs, however, the best known upper bound for as special class as planar graphs are, is ∆+12 [2]. In this paper, we study simple planar graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7852